PrestoPronto: a code devoted to handling large data sets

Multiresolution Data Handling for Visualization of Very Large Data Sets

Eecient Handling of Large Sets of Tuples with Sharing Trees Eecient Handling of Large Sets of Tuples with Sharing Trees

Computing with sets of tuples (n-ary relations) is often required in programming. This paper presents a new data structure dedicated to the manipulation of large sets of tuples, dubbed sharing tree. The main idea is to share in memory some sub-tuples of the set. We give algorithms for common set operations, that have theoretical complexities proportional to the sizes of the sharing trees given ...

yFS: A Journaling File System Design for Handling Large Data Sets with Reduced Seeking

In recent years, disk seek times have not improved commensurately with CPU performance, memory system performance, and disk transfer rates. Furthermore, many modern applications are making increasing use of large files. Traditional file system designs are limited in how they address these two trends. We present the design of a file system called yFS that consciously reduces disk seeking and han...

Visualising large data sets

Large data sets are different and new methods of display are needed for dealing with them. This paper reviews the standard problems in displaying large numbers of cases and variables, both continuous and categorical, and emphasises the need for improving current software. Much could be achieved by adding interactive tools to standard displays to provide greater flexibility and to facilitate a m...

A novel radial super-efficiency DEA model handling negative data

Super-efficiency model in the presence of negative data is a relatively neglected issue in the DEA field. The existing super-efficiency models have some shortcomings in practice. In this paper, a novel VRS radial super-efficiency DEA model based on Directional Distance Function (DDF) is proposed to provide a complete ranking order of units (including efficient and inefficient ones). The propose...